The dot-depth and the polynomial hierarchies correspond on the delta levels
نویسندگان
چکیده
It is well-known that the Σkand Πk-levels of the dot-depth hierarchy and the polynomial hierarchy correspond via leaf languages. We extend this correspondence to the ∆k-levels of these hierarchies: Leaf (∆ k ) = ∆ k . The same methods are used to give evidence against an earlier conjecture of Straubing and Thérien about a leaf-language upper bound for BPP. Research supported in part by NUS grant number RP3992710 Most of this research took part while the author was visiting the University of Tübingen, supported by a fellowship from the Alexander von Humboldt Foundation. Research supported by grants from NSERC, FQRNT and the Alexander von Humboldt Foundation.
منابع مشابه
The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels
It is well-known that the Σkand Πk-levels of the dot-depth hierarchy and the polynomial hierarchy correspond via leaf languages. In this paper this correspondence will be extended to the ∆k-levels of these hierarchies: LeafP(∆Lk ) = ∆ p k.
متن کاملOn annihilator ideals in skew polynomial rings
This article examines annihilators in the skew polynomial ring $R[x;alpha,delta]$. A ring is strongly right $AB$ if everynon-zero right annihilator is bounded. In this paper, we introduce and investigate a particular class of McCoy rings which satisfy Property ($A$) and the conditions asked by P.P. Nielsen. We assume that $R$ is an ($alpha$,$delta$)-compatible ring, and prove that, if $R$ is ni...
متن کاملبررسی اثر صحیح کوانتومی هال در سیستمهای دارای ناخالصی به روش تبدیل پیمانه‌ای در حضور نقطه‌های کوانتومی
In this paper we study the integer quantum Hall effect (IQHE) on the systems with different types of impurities in delta and gaussian forms. The Landau energy levels in the presence of impurity split in two different levels,the extended and localized levels, emerging then the Hall step. Finally, we add a specified form of a quantum dot potential to a system with impurity, and observed that incr...
متن کاملConcatenation Hierarchies and Forbidden Patterns
We make the following progress on the dot–depth problem: (1) We introduce classes CB n and CL n of starfree languages defined via forbidden patterns in finite automata. It is shown for all n 0 that CB n (CL n) contains level n + 1=2 of the dot–depth hierarchy (Straubing–Thérien hierarchy, resp.). Since we prove that CB n and CL n have decidable membership problems, this yields a lower bound alg...
متن کاملA Reducibility for the Dot-Depth Hierarchy
Hierarchies considered in computability theory and in complexity theory are related to some reducibilities in the sense that levels of the hierarchies are downward closed and have complete sets. In this paper we propose a reducibility having similar relationship to the Brzozowski’s dot-depth hierarchy and some its refinements. We prove some basic facts on the corresponding degree structure and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 16 شماره
صفحات -
تاریخ انتشار 2005